Matrix Model Combinatorics: Applications to Folding and Coloring
نویسنده
چکیده
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these to the study of various folding problems arising from physics, including: the meander (or polymer folding) problem “enumeration of all topologically inequivalent closed non-intersecting plane curves intersecting a line through a given number of points” and a fluid membrane folding problem reformulated as that of “enumerating all vertex-tricolored triangulations of arbitrary genus, with given numbers of vertices of either color”.
منابع مشابه
Satellite communications and multigraph edge-coloring
An overview of satellite communication scheduling and its relation to edge-coloring of multigraphs is given. Then a theorem about a restricted class of multigraphs is proved to obtain conditions for scheduling in a satellite communications network of practical interest Some limitations of the multigraph model are then discussed.
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملCombinatorial Nullstellensatz
We present a general algebraic technique and discuss some of its numerous applications in Combinatorial Number Theory, in Graph Theory and in Combinatorics. These applications include results in additive number theory and in the study of graph coloring problems. Many of these are known results, to which we present unified proofs, and some results are new.
متن کاملSpectral Theorem and Applications
This paper is dedicated to present a proof of the Spectral Theorem, and to discuss how the Spectral Theorem is applied in combinatorics and graph theory. In this paper, we also give insights into the ways in which this theorem unveils some mysteries in graph theory, such as expander graphs and graph coloring.
متن کامل